منابع مشابه
Ecient Algorithms for Variance-based K-clustering
In this paper we consider the k-clustering problem for n points in the d-dimensional space, motivated from the problem of computing a color lookup table for frame bu er display, and that of compressing two-dimensional image data. Using the technique of computational geometry, this clustering problem is investigated in a uni ed manner.
متن کاملReduct and Variance Based Clustering of High Dimensional Dataset
In high dimensional data, general performance of the traditional clustering algorithms decreases. As some dimensions are likely to be irrelevant or contain noisy data and randomly selected initial centre of the clusters converge the clustering to local minima. In this paper, we propose a framework for clustering high dimensional data with attribute subset selection and efficient cluster centre ...
متن کاملDP-space: Bayesian Nonparametric Subspace Clustering with Small-variance Asymptotics
Subspace clustering separates data points approximately lying on union of affine subspaces into several clusters. This paper presents a novel nonparametric Bayesian subspace clustering model that infers both the number of subspaces and the dimension of each subspace from the observed data. Though the posterior inference is hard, our model leads to a very efficient deterministic algorithm, DP-sp...
متن کاملVariance-based Clustering Technique for Distributed Data Mining Applications
Nowadays, huge amounts of data are naturally collected in distributed sites due to different facts and moving these data through the network for extracting useful knowledge is almost unfeasible for either technical reasons or policies. Furthermore, classical parallel algorithms cannot be applied, specially in loosely coupled environments. This requires to develop scal-able distributed algorithm...
متن کاملVariance clustering improved dynamic conditional correlation MGARCH estimators
It is well-known that the estimated GARCH dynamics exhibit common patterns. Starting from this fact we extend the Dynamic Conditional Correlation (DCC) model by allowing for a clustering structure of the univariate GARCH parameters. The model can be estimated in two steps, the first devoted to the clustering structure, and the second focusing on correlation parameters. Differently from the trad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1998
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-98-04524-9